Cycle length parities and the chromatic number

In 1966 Erdős and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at most l is at most l + 1. Similarly, in 1992 Gyárfás proved that the chromatic number of graphs which have at most k odd cycle lengths is at most 2k + 2 which was originally conjectured by Bollobás and Erdős. Here we consider the influence of the parities of the cycle lengths modulo some odd prime on the chromatic number of graphs. As our main result we prove the following: Let p be an odd prime, k ∈ N and I ⊆ {0, 1, . . . , p− 1} with |I| ≤ p− 1. If G is a graph such that the set of cycle lengths of G contains at most k elements which are not in I modulo p, then χ(G) ≤ ( 1 + |I| p−|I| ) k + p(p− 1)(r(2p, 2p) + 1) + 1 where r(p, q) denotes the ordinary Ramsey number.